Optimal snapshot location for computing POD basis functions
نویسندگان
چکیده
منابع مشابه
Optimal snapshot location for computing POD basis functions
The construction of reduced order models for dynamical systems using proper orthogonal decomposition (POD) is based on the information contained in so-called snapshots. These provide the spatial distribution of the dynamical system at discrete time instances. This work is devoted to optimizing the choice of these time instances in such a manner that the error between the POD-solution and the tr...
متن کاملAdaptive POD basis computation for parametrized nonlinear systems using optimal snapshot location
The construction of reduced-order models for parametrized partial differential systems using proper orthogonal decomposition (POD) is based on the information of the so-called snapshots. These provide the spatial distribution of the nonlinear system at discrete parameter and/or time instances. In this work a strategy is used, where the POD reduced-order model is improved by choosing additional ...
متن کاملComputing Optimal Discrete Morse Functions
The essential structural information of discrete Morse functions is captured by so-called Morse matchings. We show that computing optimal Morse matchings is NP-hard and give an integer programming formulation for the problem. Then we present first polyhedral results for the corresponding polytope and report on some preliminary computational results.
متن کاملOptimal Basis from Empirical Orthogonal Functions and Wavelet Analysis for Data Assimilation: Optimal Basis WADAi
Wavelet Analysis provides a new orthogonal basis set which is localized in both physical space and Fourier transform space. Empirical Orthogonal Functions (EOFs), on the other hand, provide a global representation of data sets. Here we investigate the various ways in which one can combine these basis sets for optimal representation of data. EOFs represent the global large scale information and ...
متن کاملOptimal Facility Location under Various Distance Functions
We present e cient algorithms for two problems of facility location. In both problems we want to determine the location of a single facility with respect to n given sites. In the rst we seek a location that maximizes a weighted distance function between the facility and the sites, and in the second we nd a location that minimizes the sum (or sum of the squares) of the distances of k of the site...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ESAIM: Mathematical Modelling and Numerical Analysis
سال: 2010
ISSN: 0764-583X,1290-3841
DOI: 10.1051/m2an/2010011